public class MuCircularQueue {
    private int[] elem;
    private int front;
    private int rear;

    public MuCircularQueue(int k){
        //采用浪费一个位置来判断是否为满，所以要多开辟一个格子的空间
        this.elem = new int[k+1];
    }
    public boolean isEmpty(){
        return  front == rear;
    }
    public boolean isFull(){
        if ((rear+1)%elem.length == front){
            return true;
        }
        return false;
    }
    //入队操作
    public boolean enQueue(int value){
        if (isFull()){
            return false;
        }
        elem[rear] = value;
        rear = (rear+1)%elem.length;
        return true;
    }

    //出队操作
    public boolean deQueue(){
        if (isEmpty()){
            return false;
        }
        front = (front+1)%elem.length;
        return true;
    }

    //得到队头元素
    public int Front(){
        if (isEmpty()){
            return -1;
        }
        return  elem[front];
    }

    //得到队尾元素
    public int Rear(){
        if (isEmpty()){
            return -1;
        }
        int index = (rear == 0)?elem.length-1:rear-1;
        return  index;
    }


}

